Erratum to: Incremental algorithms for the maximum internal spanning tree problem

In the original paper [1], there are two errors on page 5. The rules in algorithm not sufficient since we omitted one rule during publication. following should be added to paper. Rule 3: If P1 = (u, v) and P2 (x, y) maximal leaf-paths both with vertices T, where u x leaves T (v, ∈ E(G), remove (y′, then add y′ is non-leaf neighbor of y T. expression Algorithm 2 accurate. It modified as follows. Line Exhaustively apply Rules 1–3, for i {2, 3} only when none j 1 ⩽ < applicable. 8: Determine longest path P among all paths whose endpoints have nonempty neighbors \ V(T′).